On Secret Multiple Image Sharing

In traditional secret sharing schemes for general access structures, a secret can be encoded into n sets of (shadow, key)’s which are distributed to n participants one by one. Only those participants belonging to a pre-defined qualified subset can recover the shared secret by using their (shadow, key)’s. The size of (shadow, key)’s may be different for different participants. This problem exists when the traditional secret sharing schemes are adopted to cope with the sharing of multiple secret images for general access structures. Specifically, one participants may hold more than one set of (shadow, key)’s. In this paper, we design a new multiple secret images sharing scheme for both of the r out of n threshold and general access structures. Our scheme produces n keys with a constant size, which are distributed to the n participants, and some shadows which are stored in public. Each participant in our scheme holds only a constant-size key. The burden for each participant to carry one or more shadow(s) in traditional secret multiple images sharing schemes can be removed